Are Fibonacci Heaps Optimal?
نویسندگان
چکیده
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 ≤ t ≤ n, which have Ω(nlogt + n + m) complexity. Although Fibonacci heaps do not achieve this bound, we present a modified Fibonacci heap which does, and so is optimal under our assumptions.
منابع مشابه
Pairing Heaps are Sub - optimalbyMichael
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been veri ed that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been ob...
متن کاملReplacing Mark Bits with Randomness in Fibonacci Heaps
A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit” which serves only to ensure efficiency of heap operations, not their correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin...
متن کاملImproved Upper Bounds for Pairing Heaps
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decrease-Key.
متن کاملFat Heaps without Regular Counters
We introduce a variant of fat heaps that does not rely on regular counters, and still achieves the optimal worst-case bounds: O(1) for find-min, insert and decrease, and O(lgn) for delete and delete-min. Our variant is simpler to explain, more efficient, and easier to implement. Experimental results suggest that our implementation is superior to structures, like run-relaxed heaps, that achieve ...
متن کاملResolving a Question about Randomized Fibonacci Heaps in the Negative
In this project, we study a randomized variant of Fibonacci heaps where instead of using mark bits, one flips coins in order to determine whether to cascade bringing nodes into the root list. Although it seems intuitive that such heaps should have the same expected performance as standard Fibonacci heaps—and Karger has conjectured as such—the only previous work was an O(log s) upper bound using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994